offline algorithmの例文

例文携帯版

For many problems, online algorithms cannot match the performance of offline algorithms.
Map matching algorithms can be divided in real-time and offline algorithms.
So, we cannot get away with just using free transpositions for the optimum offline algorithm.
Offline algorithms are used after the data is recorded and are then matched to the road network.
If the ratio between the performance of an online algorithm and an optimal offline algorithm is bounded, the online algorithm is called "'competitive " '.
An optimal offline algorithm using only free exchanges would cost 9 ( 3 + 3 + 2 + 1 ), whereas an optimal offline algorithm using only paid exchanges would cost 8.
An optimal offline algorithm using only free exchanges would cost 9 ( 3 + 3 + 2 + 1 ), whereas an optimal offline algorithm using only paid exchanges would cost 8.
An online algorithm for this problem has to reorder the elements and serve requests based only on the knowledge of previously requested items and hence its strategy may not have the optimum cost as compared to an offline algorithm that gets to see the entire request sequence and devise a complete strategy before serving the first request.